STAN - CS - 76 - 658 Is “ sometime ” sometimes better than “ always ” ? Intermittent assertions in proving program correctness
نویسندگان
چکیده
منابع مشابه
"A la Burstall" Intermittent Assertions Induction Principles for Proving Inevitable Ability Properties of Programs
123 " A la Burstall " intermittent assertions induction principles for proving inevitability properties of programs Cousot, P. and R. Cousot, " A la Burstall " intermittent assertions induction principles for proving inevitability properties of programs, Theoretical Computer Science 120 (1993) 123-15.5. We formalize Burstall's (1974) intermittent assertions method (initially conceived for provi...
متن کاملIntroductory Programming Course: From Classics to Formal Methods
Introductory courses in CS, especially those aimed at introductory programming concepts or fundamental concepts in CS, represent the core courses which give the student specific insight into what the body of knowledge of Computer Science entails. Due to this great importance the curriculum planning of these courses should be undertaken with special care. It is, however, a matter of some concern...
متن کاملOn the Effectiveness of Theorem Proving Guided Discovery of Formal Assertions for a Register Allocator in a High-Level Synthesis System
This paper presents a formal speciication and a proof of correctness for the register optimization task in high{level synthesis. A widely implemented register optimization algorithm is modeled in higher{order logic and veriied in a theorem prover environment. A rich collection of correctness properties is systematically formulated during the theorem proving exercise. These properties constitute...
متن کاملEffectively-Propositional Reasoning about Reachability in Linked Data Structures
This paper proposes a novel method of harnessing existing SAT solvers to verify reachability properties of programs that manipulate linked-list data structures. Such properties are essential for proving program termination, correctness of data structure invariants, and other safety properties. Our solution is complete, i.e., a SAT solver produces a counterexample whenever a program does not sat...
متن کاملRegion Logic: local reasoning for Java programs and its automation
Shared mutable objects are a cornerstone of the object-oriented paradigm. The ability to share mutable data eliminates unnecessary cloning and gives rise to efficient data structures. Yet, formal reasoning about partial correctness of object-oriented programs is notoriously difficult due to the very same features, viz., sharing and mutable objects. The core problem is aliasing, and one of the c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998